Generalized higher order Stirling numbers

Generalized higher order Stirling numbers

Stirling Numbers and Generalized Zagreb Indices

We show how generalized Zagreb indices $M_1^k(G)$ can be computed by using a simple graph polynomial and Stirling numbers of the second kind. In that way we explain and clarify the meaning of a triangle of numbers used to establish the same result in an earlier reference.

Generalized Stirling Permutations and Forests: Higher-Order Eulerian and Ward Numbers

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural three-parameter generalization of the well-known Eulerian numbers. We give the generating function for this new class of numbers and, in the simplest cases, we...

Generalized Stirling and Lah numbers

The theory of modular binomial lattices enables the simultaneous combinatorial analysis of finite sets, vector spaces, and chains. Within this theory three generalizations of Stifling numbers of the second kind, and of Lah numbers, are developed. 1. Stirling numbers and their formal generalizations The nota t ional convent ions of this paper are as follows: N = {0,1,2 . . . . }, P = {1,2,. . . ...

Combinatorially interpreting generalized Stirling numbers

The Stirling numbers of the second kind { n k } (counting the number of partitions of a set of size n into k non-empty classes) satisfy the relation